Generating Hamiltonian Cycles in Complete Graphs
نویسنده
چکیده
We prove that hamiltonian cycles of complete graphs can be generated in a Gray code manner by means of small local interchanges.
منابع مشابه
On cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملGenerating all the cubic graphs that have a 6-cycle double cover
A cycle double cover (CDC) of an undirected graph is a collection of the graph’s cycles such that every edge of the graph belongs to exactly two cycles. We describe a constructive method for generating all the cubic graphs that have a 6-CDC (a CDC in which every cycle has length 6). We also prove that all such graphs have a Hamiltonian cycle.
متن کاملCounting Hamiltonian cycles on planar random lattices
Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles is obtained and its singularity is studied. Hamiltonian cycles have often been used to model collapsed polymer globules[1]. A Hamiltonian cycle of a graph is a closed path which visits each of the vertices once and only once. The number of Hamiltonian cycles on a lattice cor...
متن کاملKnotted Hamiltonian cycles in spatial embeddings of complete graphs
We show the complete graph on n vertices contains a knotted Hamiltonian cycle in every spatial embedding, for n > 7. Moreover, we show that for n > 8, the minimum number of knotted Hamiltonian cycles in every embedding of Kn is at least (n−1)(n−2) . . . (9)(8). We also prove K8 contains at least 3 knotted Hamiltonian cycles in every spatial embedding.
متن کاملHamiltonian Cycles in Solid Grid Graphs
A grid graph is a nite node-induced subgraph of the innnite two-dimensional integer grid. A solid grid graph is a grid graph without holes. For general grid graphs, the Hamiltonian cycle problem is known to be NP-complete. We give a polynomial-time algorithm for the Hamiltonian cycle problem in solid grid graphs, resolving a longstanding open question posed in IPS82]. In fact, our algorithm can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994